Ambos-Spies, K.: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

Honest polynomial time reducibilities and the P=?NP problem

Klaus Ambos-Spies

Journal:

Journal of Computer and System Sciences

Year:

1989

Language:

english

File:

PDF, 2.23 MB

english, 1989

2

Diagonalizations over polynomial time computable sets

Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig

Journal:

Theoretical Computer Science

Year:

1987

Language:

english

File:

PDF, 3.42 MB

english, 1987

3

Initial Segments of Recursive Linear Orders

Klaus Ambos-Spies, S. Barry Cooper, Steffen Lempp

Journal:

Year:

1997

Language:

english

File:

PDF, 102 KB

english, 1997

4

Maximal Pairs of Computably Enumerable Sets in the Computably Lipschitz Degrees

Klaus Ambos-Spies, Decheng Ding, Yun Fan, Wolfgang Merkle

Journal:

Theory of Computing Systems

Year:

2013

Language:

english

File:

PDF, 747 KB

english, 2013

5

Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

Ambos-Spies, K., Lempp, S., Lerman, M.

Journal:

Journal of the London Mathematical Society

Year:

1994

Language:

english

File:

PDF, 1.14 MB

english, 1994

6

[Handbook of the History of Logic] Computational Logic Volume 9 || Degrees of Unsolvability

Ambos-Spies, Klaus

Year:

2014

Language:

english

File:

PDF, 406 KB

english, 2014

7

An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees

Klaus Ambos-Spies, Carl G. Jockusch, Jr., Richard A. Shore and Robert I. Soare

Journal:

Transactions of the American Mathematical Society

Year:

1984

Language:

english

File:

PDF, 2.14 MB

english, 1984

8

On Pairs of Recursively Enumerable Degrees

Klaus Ambos-Spies

Journal:

Transactions of the American Mathematical Society

Year:

1984

Language:

english

File:

PDF, 2.18 MB

english, 1984

9

Anti-Mitotic Recursively Enumerable Sets

Klaus Ambos-Spies

Journal:

Mathematical Logic Quarterly

Year:

1985

Language:

english

File:

PDF, 994 KB

english, 1985

10

Discontinuity of Cappings in the Recursively Enumerable Degrees and Strongly Nonbranching Degrees

Klaus Ambos-Spies, Ding Decheng

Journal:

Mathematical Logic Quarterly

Year:

1994

Language:

english

File:

PDF, 1.66 MB

english, 1994

11

Weakly Computable Real Numbers

Klaus Ambos-Spies, Klaus Weihrauch, Xizhong Zheng

Journal:

Journal of Complexity

Year:

2000

Language:

english

File:

PDF, 161 KB

english, 2000

12

Separating NP-Completeness Notions under Strong Hypotheses

Klaus Ambos-Spies, Levke Bentzien

Journal:

Journal of Computer and System Sciences

Year:

2000

Language:

english

File:

PDF, 227 KB

english, 2000

13

The recursively enumerable degrees have infinitely many one-types

Klaus Ambos-Spies, Robert I. Soare

Journal:

Annals of Pure and Applied Logic

Year:

1989

Language:

english

File:

PDF, 2.40 MB

english, 1989

14

The continuity of cupping to 0'

Klaus Ambos-Spies, Alistair H. Lachlan, Robert I. Soare

Journal:

Annals of Pure and Applied Logic

Year:

1993

Language:

english

File:

PDF, 1.07 MB

english, 1993

15

Undecidability and 1-types in the recursively enumerable degrees

Klaus Ambos-Spies, Richard A. Shore

Journal:

Annals of Pure and Applied Logic

Year:

1993

Language:

english

File:

PDF, 2.23 MB

english, 1993

16

On the relative complexity of hard problems for complexity classes without complete problems

Klaus Ambos-Spies

Journal:

Theoretical Computer Science

Year:

1989

Language:

english

File:

PDF, 2.02 MB

english, 1989

17

Genericity and measure for exponential time

Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn

Journal:

Theoretical Computer Science

Year:

1996

Language:

english

File:

PDF, 1.14 MB

english, 1996

18

Inductive inference and computable numberings

Klaus Ambos-Spies, Serikzhan Badaev, Sergey Goncharov

Journal:

Theoretical Computer Science

Year:

2011

Language:

english

File:

PDF, 334 KB

english, 2011

19

Embeddings of N5 and the contiguous degrees

Klaus Ambos-Spies, Peter A. Fejer

Journal:

Annals of Pure and Applied Logic

Year:

2001

Language:

english

File:

PDF, 284 KB

english, 2001

20

Preface

Klaus Ambos-Spies, Theodore A. Slaman, Robert I. Soare

Journal:

Annals of Pure and Applied Logic

Year:

1998

Language:

english

File:

PDF, 62 KB

english, 1998

21

Undecidability and 1-types in intervals of the computably enumerable degrees

Klaus Ambos-Spies, Denis R. Hirschfeldt, Richard A. Shore

Journal:

Annals of Pure and Applied Logic

Year:

2000

Language:

english

File:

PDF, 338 KB

english, 2000

22

Almost complete sets

Klaus Ambos-Spies, Wolfgang Merkle, Jan Reimann, Sebastiaan A. Terwijn

Journal:

Theoretical Computer Science

Year:

2003

Language:

english

File:

PDF, 353 KB

english, 2003

23

Resource bounded randomness and weakly complete problems

Klaus Ambos-Spies, Sebastiaan A. Terwijn, Zheng Xizhong

Journal:

Theoretical Computer Science

Year:

1997

Language:

english

File:

PDF, 865 KB

english, 1997

24

Cappable recursively enumerable degrees and Post's program

Klaus Ambos-Spies, André Nies

Journal:

Archive for Mathematical Logic

Year:

1992

Language:

english

File:

PDF, 329 KB

english, 1992

25

Cupping and noncapping in the r.e. weak truth table and turing degrees

Klaus Ambos-Spies

Journal:

Archive for Mathematical Logic

Year:

1985

Language:

english

File:

PDF, 930 KB

english, 1985

26

Minimal pairs and complete problems

Klaus Ambos-Spies, Steven Homer, Robert I. Soare

Journal:

Theoretical Computer Science

Year:

1994

Language:

english

File:

PDF, 861 KB

english, 1994

27

Comparing Nontriviality for E and EXP

Klaus Ambos-Spies, Timur Bakibayev

Journal:

Theory of Computing Systems

Year:

2012

Language:

english

File:

PDF, 564 KB

english, 2012

28

Inhomogeneities in the polynomial-time degrees: The degrees of super sparse sets

Klaus Ambos-Spies

Journal:

Information Processing Letters

Year:

1986

Language:

english

File:

PDF, 401 KB

english, 1986

29

A note on complete problems for complexity classes

Klaus Ambos-Spies

Journal:

Information Processing Letters

Year:

1986

Language:

english

File:

PDF, 280 KB

english, 1986

30

Computability in Europe 2009

Klaus Ambos-Spies, Arnold Beckmann, Samuel R. Buss, Benedikt Löwe

Journal:

Annals of Pure and Applied Logic

Year:

2012

Language:

english

File:

PDF, 204 KB

english, 2012

31

Sublattices of the polynomial time degrees

Klaus Ambos-Spies

Journal:

Information and Control

Year:

1985

Language:

english

File:

PDF, 1.05 MB

english, 1985

32

[Lecture Notes in Computer Science] Mathematical Theory and Computational Practice Volume 5635 || Lower Bounds for Kernelizations and Other Preprocessing Procedures

Ambos-Spies, Klaus, Löwe, Benedikt, Merkle, Wolfgang

Year:

2009

Language:

english

File:

PDF, 231 KB

english, 2009

33

Preface

Ambos-Spies, Klaus, Bagaria, Joan, Casanovas, Enrique, Kohlenbach, Ulrich

Journal:

Annals of Pure and Applied Logic

Year:

2013

Language:

english

File:

PDF, 126 KB

english, 2013

34

Nontriviality for exponential time w.r.t. weak reducibilities

Ambos-Spies, Klaus, Bakibayev, Timur

Journal:

Theoretical Computer Science

Year:

2013

Language:

english

File:

PDF, 259 KB

english, 2013

35

Bounding non-GL2 and R.E.A.

Ambos-Spies, Klaus, Ding, Decheng, Wang, Wei, Yu, Liang

Journal:

Journal of Symbolic Logic

Year:

2009

Language:

english

File:

PDF, 202 KB

english, 2009

36

The partial orderings of the computably enumerable ibT-degrees and cl-degrees are not elementarily equivalent

Ambos-Spies, Klaus, Bodewig, Philipp, Fan, Yun, Kräling, Thorsten

Journal:

Annals of Pure and Applied Logic

Year:

2013

Language:

english

File:

PDF, 246 KB

english, 2013

37

Bounding Non-GL₂ and R.E.A

Klaus Ambos-Spies, Decheng Ding, Wei Wang and Liang Yu

Journal:

Journal of Symbolic Logic

Year:

2009

Language:

english

File:

PDF, 1022 KB

english, 2009

38

Comparing DNR and WWKL

Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp and Theodore A. Slaman

Journal:

Journal of Symbolic Logic

Year:

2004

Language:

english

File:

PDF, 1.61 MB

english, 2004

39

[IEEE 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Portland, OR, USA (1985.10.21-1985.10.23)] 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) - Three theorems on polynomial degrees of NP-sets

Ambos-Spies, Klaus

Year:

1985

Language:

english

File:

PDF, 682 KB

english, 1985

40

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Separating NP-completeness notions under strong hypotheses

Ambos-Spies, K., Bentzien, L.

Year:

1997

Language:

english

File:

PDF, 684 KB

english, 1997

41

[IEEE Comput. Soc. Press Structure in Complexity Theory. Tenth Annual IEEE Conference - Minneapolis, MN, USA (19-22 June 1995)] Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference - Resource-bounded genericity

Ambos-Spies, K.

Year:

1995

Language:

english

File:

PDF, 1.72 MB

english, 1995

42

[IEEE Comput. Soc Computational Complexity. Sixteenth Annual IEEE Conference - Chicago, IL, USA (18-21 June 2001)] Proceedings 16th Annual IEEE Conference on Computational Complexity - Hausdorff dimension in exponential time

Ambos-Spies, K., Merkle, W., Reimann, J., Stephan, F.

Year:

2000

Language:

english

File:

PDF, 715 KB

english, 2000

43

[IEEE Comput. Soc. Press Computational Complexity (Formerly Structure in Complexity Theory) - Philadelphia, PA, USA (24-27 May 1996)] Proceedings of Computational Complexity (Formerly Structure in Complexity Theory) - A comparison of weak completeness notions

Ambos-Spies, K., Mayordomo, E., Xizhong Zheng,

Year:

1996

Language:

english

File:

PDF, 744 KB

english, 1996

44

[Lecture Notes in Mathematics] Recursion Theory Week Volume 1432 || A direct construction of a minimal recursively enumerable truth-table degree

Ambos-Spies, Klaus, Müller, Gert H., Sacks, Gerald E.

Year:

1990

Language:

english

File:

PDF, 1.08 MB

english, 1990

45

Degree theoretical splitting properties of recursively enumerable sets

Ambos-Spies, Klaus, Fejer, Peter A.

Journal:

Journal of Symbolic Logic

Year:

1988

Language:

english

File:

PDF, 1.83 MB

english, 1988

46

Comparing DNR and WWKL

Ambos-Spies, Klaus, Kjos-Hanssen, Bjørn, Lempp, Steffen, Slaman, Theodore A.

Journal:

Journal of Symbolic Logic

Year:

2004

Language:

english

File:

PDF, 1.04 MB

english, 2004

47

An Extension of the Nondiamond Theorem in Classical and α-Recursion Theory

Klaus Ambos-Spies

Journal:

Journal of Symbolic Logic

Year:

1984

Language:

english

File:

PDF, 1.38 MB

english, 1984

48

Numberings and learnability

Ambos-Spies, K.

Journal:

Lobachevskii Journal of Mathematics

Year:

2014

Language:

english

File:

PDF, 433 KB

english, 2014

49

Decidability of the two-quantifier theory of the recursively enumerable weak truth-table degrees and other distributive upper semi-lattices

Ambos-Spies, Klaus, Fejer, Peter A., Lempp, Steffen, Lerman, Manuel

Journal:

Journal of Symbolic Logic

Year:

1996

Language:

english

File:

PDF, 1.66 MB

english, 1996

50

Lattice embeddings into the recursively enumerable degrees

Ambos-Spies, K., Lerman, M.

Journal:

Journal of Symbolic Logic

Year:

1986

Language:

english

File:

PDF, 1.02 MB

english, 1986

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски